Location:
Search - prim algorithm
Search list
Description: 最小生成树问题贪心(Prim)算法，该程序原自王晓东算法设计，程序已调通-Greedy minimum spanning tree problem (Prim) algorithm, the program Xiaodong algorithm since the original design, procedures have been transferred Qualcomm
Platform: |
Size: 1024 |
Author: ss |
Hits:
Description: PRIM算法 对任意给定的网和起点，用PRIM算法的基本思想求解出所有的最小生成树。-PRIM algorithm for any given network and the starting point, PRIM algorithm used to solve the basic idea of all the minimum spanning tree.
Platform: |
Size: 613376 |
Author: 易涛 |
Hits:
Description: 自己编的，在VB中实现普里姆最小生成树算法的代码，有图的，边的权值是随机生成的，5个节点，点“generate tree”，就会显示出最小树。-Own, and in VB in the minimum spanning tree algorithm prim implementation code, there is graph, edge weights are randomly generated, five nodes, point " generate tree" , will show the most trees.
Platform: |
Size: 2048 |
Author: |
Hits:
Description: 本程序是用来prim算法用C++的完全实现,可供大家学习使用.-This procedure is used prim algorithm using C++ implementation of the fully available for everyone to use study.
Platform: |
Size: 280576 |
Author: xj |
Hits:
Description: 数据结构学习过程中的实验
PRIM算法，简单了一点，但算法是很经典的-Data structure of the experimental learning process PRIM algorithm, a bit simple, but the algorithm is a classic
Platform: |
Size: 1024 |
Author: 陈文取 |
Hits:
Description: 普里姆算法，求图的最小生成树问题。用的是C语言，比书上的详细。-Prim algorithm, and the minimum spanning tree problem Fig. Using the C language, the detailed than the book.
Platform: |
Size: 1024 |
Author: 熊龙龙 |
Hits:
Description: 这个算法通过matlab仿真得到的最小生成树Prim算法-Matlab simulation of the algorithm obtained Prim minimum spanning tree algorithm
Platform: |
Size: 3072 |
Author: 甄伟 |
Hits:
Description: 【系统功能】
LL-路径优化系统主要用于求解已知坐标的规模为N的城镇间最短路径问题。
【主要算法】
1：利用Prim算法求解带约束条件的连通图的最小生成树；
2：利用基于单亲遗传算法求解带约束条件的TSP问题。
-【Function】 LL-path optimization system is mainly used to solve the known coordinates for the N scale of the problem of the shortest path between cities and towns. The main algorithm 【】 1: using Prim algorithm with constraint condition of the minimum spanning tree-connected graph 2: the use of genetic algorithm based on the single condition with the TSP problem.
Platform: |
Size: 575488 |
Author: 张玉芨 |
Hits:
Description: 实现中国铁路最短路径的计算，基于图的PRIM算法，MFC实现动态演示-China Railway the shortest path to achieve the calculation of the PRIM algorithm based on the map, MFC dynamic presentation
Platform: |
Size: 1961984 |
Author: zhangyan |
Hits:
Description: 自己写的一个组合数学的Prim算法，上大一的时候写的，写的不好不要见怪-Written in a combination of their own mathematical algorithm for maximum matching
Platform: |
Size: 2541568 |
Author: 叶晗 |
Hits:
Description: matlab实现的最小生成树的两种最基本的算法即Kruskal，Prim。-matlab realization of the minimum spanning tree algorithm that is, the two most basic Kruskal, Prim.
Platform: |
Size: 1024 |
Author: michael wang |
Hits:
Description: 用普里姆（Prim)算法求用邻接矩阵存储结构表示的图或网的最小生成树-With the prim algorithm is seeking to use adjacency matrix storage structure, said the plan or network, minimum spanning tree
Platform: |
Size: 1024 |
Author: wuruijin |
Hits:
Description: Prim算法（节点可任意选定）
Prim算法（节点可任意选定）-prim algorithm
Platform: |
Size: 14336 |
Author: 李雪 |
Hits:
Description: Prim算法用于求无向图的最小生成树.
-Prim algorithm is used to seek an undirected graph of the minimum spanning tree
Platform: |
Size: 1024 |
Author: 花脸的猫 |
Hits:
Description: prim算法 最小生成树 prim matlab
-prim matlab
Platform: |
Size: 2048 |
Author: chenyuanhua |
Hits:
Description: prim算法 ，输入一个图，然后 求它的最小生成树 -prim algorithm, input a graph, and then seek its minimum spanning tree
Platform: |
Size: 1024 |
Author: 雅静 |
Hits:
Description: 最小生成树之Prim算法 Prim算法用于求无向图的最小生成树
设图G =（V，E），其生成树的顶点集合为U。
①、把v0放入U。
②、在所有u∈U，v∈V-U的边(u，v)∈E中找一条最小权值的边，加入生成树。
③、把②找到的边的v加入U集合。如果U集合已有n个元素，则结束，否则继续执行②。
其算法的时间复杂度为O(n^2)
Prim算法实现：
（1）集合：设置一个数组set(i=0,1,..,n-1),初始值为 0,代表对应顶点不在集合中（注意：顶点号与下标号差1）
（2）图用邻接阵表示，路径不通用无穷大表示，在计算机中可用一个大整数代替。
采用堆可以将复杂度降为O(m log n)，如果采用Fibonaci堆可以将复杂度降为O(n log n + m)-Prim minimum spanning tree algorithm of Prim algorithm for the undirected minimum spanning tree graph
Set graph G = (V, E), the spanning tree of the vertex set of the U.
①, the v0 into U.
②, all u ∈ U, v ∈ VU edge (u, v) ∈ E, find a minimum weight edge, join the spanning tree.
③, ② to find the edge to join the U v collection. If the set has n elements U, then the end, or continue to ②.
The algorithm s time complexity is O (n ^ 2)
Prim algorithm:
(1) set: Set an array of set (i = 0,1, .., n-1), the initial value is 0, the corresponding vertex is not in the collection (Note: vertex under the label with the No. 1 bad)
(2) map with the adjacency matrix that is not universal infinite path that is available in the computer instead of a large integer.
Complexity of using the heap can be reduced to O (m log n), if the heap can be used Fibonaci reduced complexity O (n log n+ m)
Platform: |
Size: 1024 |
Author: 杨博文 |
Hits:
Description: 数据结构中的PRIM算法，在DEV c++测试通过，数据结构为邻接矩阵-The PRIM algorithm data structure, in DEV c++ test, the data structure of adjacency matrix
Platform: |
Size: 1024 |
Author: lizhenye |
Hits:
Description: 实现了数据结构中的Prim算法，输入初始值能得到Prim图-Data structure to achieve the Prim algorithm, enter the initial value can be Prim map
Platform: |
Size: 176128 |
Author: 胡容 |
Hits:
Description: prim算法，明了，简单，变量命名规范，适合初学者。-prim algorithm, clear, simple, variable naming conventions, for beginners.
Platform: |
Size: 1024 |
Author: 千销毁 |
Hits:
«
1
2
3
45
6
7
8
9
10
...
21
»